Block-row Hankel weighted low rank approximation
نویسندگان
چکیده
This paper extends the Weighted Low Rank Approximation (WLRA) approach towards linearly structured matrices. In the case of Hankel matrices with a special block structure an equivalent unconstrained optimization problem is derived and an algorithm for solving it is proposed.
منابع مشابه
Exact Solutions in Structured Low-Rank Approximation
Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study the critical points of this optimization problem using algebraic geometry. A particular focus lies on Hankel matrices, Sylvester matrices and generic linear spaces.
متن کاملToeplitz and Hankel matrix approximation using structured approach
structures on a model based on available prior informaAlgorithms are presented for least-squares approximation. Earlier work on these problems has primarily contion of Toeplitz and Hankel matrices from noise corsisted of using Singular Value Decomposition [4, 5, 81, rupted or ill-composed matrices, which may not have where only the rank information of the underlying sigcorrect structural or ran...
متن کاملVariable projection methods for approximate (greatest) common divisor computations
We consider the problem of finding for a given N -tuple of polynomials (real or complex) the closest N -tuple that has a common divisor of degree at least d. Extended weighted Euclidean seminorm of the coefficients is used as a measure of closeness. Two equivalent representations of the problem are considered: (i) direct parameterization over the common divisors and quotients (image representat...
متن کاملGlobal optimization for structured low rank approximation
In this paper, we investigate the complexity of the numerical construction of the Hankel structured low-rank approximation (HSLRA) problem, and develop a family of algorithms to solve this problem. Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure. Unlike many other methods described i...
متن کاملRecent process on structured low-rank approximation
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the data. For the purpose of linear static modeling, the matrix is unstructured and the corresponding modeling problem is an approximation of the matrix by another matrix of a lower rank. In the context of linear time-invariant dynamic models, the appropriate data matrix is Hankel and the corresponding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006